For efficient reasons , the lemmas are represented in propositional formulas and a sat solver is used to perform the necessary reasoning 提出了一個新的直接搜索算法,它使用了在sat問題中行之有效的沖突分析和學習機制。
Based on paper [ 1 ] and [ 2 ] , this paper gives two generating algorithms to calculate and output the special conjunctive normal forms and special disjunctive forms of given propositional formulas automatically and formally 摘要在文[ 1 ]和文[ 2 ]的基礎上,給出了命題邏輯中任一命題公式的主析取范式和主合取范式的自動生成算法,并實現了多個命題公式主范式的同時形式化輸出。
Using these algorithms , we can use computer mechanically to list truth value table of a group of propositional formulae , determine that if a given propositional formula is a tautology , a contradiction , or if the formula is satisfiable 給出了命題邏輯中任一命題公式的真值表的生成算法與命題公式類型的判定算法,實現了利用計算機對有限多個命題公式的真值表的直接計算和輸出,以及對一個命題公式是重言式、矛盾式或可滿足式的機械判定。
百科解釋
In propositional logic, a propositional formula is a type of syntactic formula which is well formed and has a truth value. If the values of all variables in a propositional formula are given, it determines a unique truth value.